[INFO] cloning repository https://github.com/goerzh/leetcode-rust
[INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/goerzh/leetcode-rust" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgoerzh%2Fleetcode-rust", kill_on_drop: false }`
[INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgoerzh%2Fleetcode-rust'...
[INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }`
[INFO] [stdout] dc922c403b97e5f21a8efc6801dc6a6936f93aa8
[INFO] testing goerzh/leetcode-rust against try#0abe69e6c16114311cc2700e972492e64d69c28f for pr-154065
[INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2Fgoerzh%2Fleetcode-rust" "/workspace/builds/worker-4-tc2/source", kill_on_drop: false }`
[INFO] [stderr] Cloning into '/workspace/builds/worker-4-tc2/source'...
[INFO] [stderr] done.
[INFO] started tweaking git repo https://github.com/goerzh/leetcode-rust
[INFO] finished tweaking git repo https://github.com/goerzh/leetcode-rust
[INFO] tweaked toml for git repo https://github.com/goerzh/leetcode-rust written to /workspace/builds/worker-4-tc2/source/Cargo.toml
[INFO] validating manifest of git repo https://github.com/goerzh/leetcode-rust on toolchain 0abe69e6c16114311cc2700e972492e64d69c28f
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }`
[INFO] crate git repo https://github.com/goerzh/leetcode-rust already has a lockfile, it will not be regenerated
[INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }`
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] [stderr]     Blocking waiting for file lock on package cache
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }`
[INFO] [stdout] 344354518a30683c57e7108aae318841c8571f4f552fe3bbcf729ba4df5fc834
[INFO] running `Command { std: "docker" "start" "-a" "344354518a30683c57e7108aae318841c8571f4f552fe3bbcf729ba4df5fc834", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "inspect" "344354518a30683c57e7108aae318841c8571f4f552fe3bbcf729ba4df5fc834", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "344354518a30683c57e7108aae318841c8571f4f552fe3bbcf729ba4df5fc834", kill_on_drop: false }`
[INFO] [stdout] 344354518a30683c57e7108aae318841c8571f4f552fe3bbcf729ba4df5fc834
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "build" "--frozen" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] 0358ceaf5b6361592936858d06aab8232decfe972867d19b77ee7b1417515ca6
[INFO] running `Command { std: "docker" "start" "-a" "0358ceaf5b6361592936858d06aab8232decfe972867d19b77ee7b1417515ca6", kill_on_drop: false }`
[INFO] [stderr]    Compiling leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/s0020_valid_parentheses.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BTreeSet`, `HashMap`, and `HashSet`
[INFO] [stdout]  --> src/s0015_3sum.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{HashMap, HashSet, BTreeSet};
[INFO] [stdout]   |                        ^^^^^^^  ^^^^^^^  ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]  --> src/s0002_add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::BorrowMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/s0215_kth_largest_element_in_an_array.rs:47:9
[INFO] [stdout]    |
[INFO] [stdout] 47 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp::Reverse`
[INFO] [stdout]   --> src/s0215_kth_largest_element_in_an_array.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |     use std::cmp::Reverse;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:25:13
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut nums = nums;
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let mut result: Vec<(i32, i32)> = Vec::new();
[INFO] [stdout]    |             ----^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `result`
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let mut result: Vec<(i32, i32)> = Vec::new();
[INFO] [stdout]    |             ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_result`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `target` is never read
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:26:26
[INFO] [stdout]    |
[INFO] [stdout] 26 |         let mut target = 0;
[INFO] [stdout]    |                          ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result` is never read
[INFO] [stdout]  --> src/s0215_kth_largest_element_in_an_array.rs:7:26
[INFO] [stdout]   |
[INFO] [stdout] 7 |         let mut result = 0;
[INFO] [stdout]   |                          ^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:35:21
[INFO] [stdout]    |
[INFO] [stdout] 35 |                 let mut temp = Solution::traversal(&mut q1, &mut q2);
[INFO] [stdout]    |                     ----^^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:40:21
[INFO] [stdout]    |
[INFO] [stdout] 40 |                 let mut temp: Vec<i32> = Solution::traversal(&mut q2, &mut q1);
[INFO] [stdout]    |                     ----^^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0020_valid_parentheses.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution();
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid` and `pair` are never used
[INFO] [stdout]   --> src/s0020_valid_parentheses.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn pair(open: char, close: char) -> bool {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0001_two_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/s0001_two_sum.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0015_3sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `three_sum`, `two_sum`, and `next_unique` are never used
[INFO] [stdout]   --> src/s0015_3sum.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     pub fn two_sum(nums: &[i32], target: i32) -> Vec<(i32, i32)> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0016_3sum_closest.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `three_sum_closest`, `three_sum`, `two_sum`, and `next_unique` are never used
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn three_sum_closest(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn three_sum(nums: &mut Vec<i32>, target: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     pub fn two_sum(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61 |     pub fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_list` is never used
[INFO] [stdout]    --> src/s0002_add_two_numbers.rs:101:12
[INFO] [stdout]     |
[INFO] [stdout] 101 |     pub fn print_list(l: Option<Box<ListNode>>) {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0215_kth_largest_element_in_an_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_kth_largest` and `partition` are never used
[INFO] [stdout]   --> src/s0215_kth_largest_element_in_an_array.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn partition(v: &mut [i32], p: i32, r: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `level_order` and `traversal` are never used
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 27 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn traversal(origin: &mut VecDeque<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.20s
[INFO] running `Command { std: "docker" "inspect" "0358ceaf5b6361592936858d06aab8232decfe972867d19b77ee7b1417515ca6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "0358ceaf5b6361592936858d06aab8232decfe972867d19b77ee7b1417515ca6", kill_on_drop: false }`
[INFO] [stdout] 0358ceaf5b6361592936858d06aab8232decfe972867d19b77ee7b1417515ca6
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }`
[INFO] [stdout] b3c35cb293a78fcdf7be34cae6700e9879ab4527b031a5df3f981b7ccc36bf83
[INFO] running `Command { std: "docker" "start" "-a" "b3c35cb293a78fcdf7be34cae6700e9879ab4527b031a5df3f981b7ccc36bf83", kill_on_drop: false }`
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/s0020_valid_parentheses.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BTreeSet`, `HashMap`, and `HashSet`
[INFO] [stdout]  --> src/s0015_3sum.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{HashMap, HashSet, BTreeSet};
[INFO] [stdout]   |                        ^^^^^^^  ^^^^^^^  ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]  --> src/s0002_add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::BorrowMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `super::*`
[INFO] [stdout]   --> src/s0215_kth_largest_element_in_an_array.rs:47:9
[INFO] [stdout]    |
[INFO] [stdout] 47 |     use super::*;
[INFO] [stdout]    |         ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp::Reverse`
[INFO] [stdout]   --> src/s0215_kth_largest_element_in_an_array.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |     use std::cmp::Reverse;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:25:13
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut nums = nums;
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let mut result: Vec<(i32, i32)> = Vec::new();
[INFO] [stdout]    |             ----^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `result`
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let mut result: Vec<(i32, i32)> = Vec::new();
[INFO] [stdout]    |             ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_result`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `target` is never read
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:26:26
[INFO] [stdout]    |
[INFO] [stdout] 26 |         let mut target = 0;
[INFO] [stdout]    |                          ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result` is never read
[INFO] [stdout]  --> src/s0215_kth_largest_element_in_an_array.rs:7:26
[INFO] [stdout]   |
[INFO] [stdout] 7 |         let mut result = 0;
[INFO] [stdout]   |                          ^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:35:21
[INFO] [stdout]    |
[INFO] [stdout] 35 |                 let mut temp = Solution::traversal(&mut q1, &mut q2);
[INFO] [stdout]    |                     ----^^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:40:21
[INFO] [stdout]    |
[INFO] [stdout] 40 |                 let mut temp: Vec<i32> = Solution::traversal(&mut q2, &mut q1);
[INFO] [stdout]    |                     ----^^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0020_valid_parentheses.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution();
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `is_valid` and `pair` are never used
[INFO] [stdout]   --> src/s0020_valid_parentheses.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn is_valid(s: String) -> bool {
[INFO] [stdout]    |            ^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 24 |     pub fn pair(open: char, close: char) -> bool {
[INFO] [stdout]    |            ^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]    Compiling leetcode v0.1.0 (/opt/rustwide/workdir)
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0001_two_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/s0001_two_sum.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0015_3sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `three_sum`, `two_sum`, and `next_unique` are never used
[INFO] [stdout]   --> src/s0015_3sum.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 35 |     pub fn two_sum(nums: &[i32], target: i32) -> Vec<(i32, i32)> {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     pub fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0016_3sum_closest.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `three_sum_closest`, `three_sum`, `two_sum`, and `next_unique` are never used
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:6:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  6 |     pub fn three_sum_closest(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 20 |     pub fn three_sum(nums: &mut Vec<i32>, target: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 46 |     pub fn two_sum(nums: &[i32], target: i32) -> bool {
[INFO] [stdout]    |            ^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 61 |     pub fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:20:8
[INFO] [stdout]    |
[INFO] [stdout] 20 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `add_two_numbers` is never used
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:23:12
[INFO] [stdout]    |
[INFO] [stdout] 22 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 23 |     pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: function `print_list` is never used
[INFO] [stdout]    --> src/s0002_add_two_numbers.rs:101:12
[INFO] [stdout]     |
[INFO] [stdout] 101 |     pub fn print_list(l: Option<Box<ListNode>>) {
[INFO] [stdout]     |            ^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0215_kth_largest_element_in_an_array.rs:1:8
[INFO] [stdout]   |
[INFO] [stdout] 1 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `find_kth_largest` and `partition` are never used
[INFO] [stdout]   --> src/s0215_kth_largest_element_in_an_array.rs:4:12
[INFO] [stdout]    |
[INFO] [stdout]  3 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout]  4 |     pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 25 |     pub fn partition(v: &mut [i32], p: i32, r: i32) -> i32 {
[INFO] [stdout]    |            ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `level_order` and `traversal` are never used
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 27 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn traversal(origin: &mut VecDeque<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::collections::HashMap`
[INFO] [stdout]  --> src/s0020_valid_parentheses.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::HashMap;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused imports: `BTreeSet`, `HashMap`, and `HashSet`
[INFO] [stdout]  --> src/s0015_3sum.rs:1:24
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::collections::{HashMap, HashSet, BTreeSet};
[INFO] [stdout]   |                        ^^^^^^^  ^^^^^^^  ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stdout]  --> src/s0002_add_two_numbers.rs:1:5
[INFO] [stdout]   |
[INFO] [stdout] 1 | use std::borrow::BorrowMut;
[INFO] [stdout]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused import: `std::cmp::Reverse`
[INFO] [stdout]   --> src/s0215_kth_largest_element_in_an_array.rs:48:9
[INFO] [stdout]    |
[INFO] [stdout] 48 |     use std::cmp::Reverse;
[INFO] [stdout]    |         ^^^^^^^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:25:13
[INFO] [stdout]    |
[INFO] [stdout] 25 |         let mut nums = nums;
[INFO] [stdout]    |             ----^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let mut result: Vec<(i32, i32)> = Vec::new();
[INFO] [stdout]    |             ----^^^^^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: unused variable: `result`
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:47:13
[INFO] [stdout]    |
[INFO] [stdout] 47 |         let mut result: Vec<(i32, i32)> = Vec::new();
[INFO] [stdout]    |             ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_result`
[INFO] [stdout]    |
[INFO] [stdout]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `target` is never read
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:26:26
[INFO] [stdout]    |
[INFO] [stdout] 26 |         let mut target = 0;
[INFO] [stdout]    |                          ^
[INFO] [stdout]    |
[INFO] [stdout]    = help: maybe it is overwritten before being read?
[INFO] [stdout]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:76:13
[INFO] [stdout]    |
[INFO] [stdout] 76 |         let mut l1 = Some(Box::new(ListNode{
[INFO] [stdout]    |             ----^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:87:13
[INFO] [stdout]    |
[INFO] [stdout] 87 |         let mut l2 = Some(Box::new(ListNode{
[INFO] [stdout]    |             ----^^
[INFO] [stdout]    |             |
[INFO] [stdout]    |             help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: value assigned to `result` is never read
[INFO] [stdout]  --> src/s0215_kth_largest_element_in_an_array.rs:7:26
[INFO] [stdout]   |
[INFO] [stdout] 7 |         let mut result = 0;
[INFO] [stdout]   |                          ^
[INFO] [stdout]   |
[INFO] [stdout]   = help: maybe it is overwritten before being read?
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:35:21
[INFO] [stdout]    |
[INFO] [stdout] 35 |                 let mut temp = Solution::traversal(&mut q1, &mut q2);
[INFO] [stdout]    |                     ----^^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: variable does not need to be mutable
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:40:21
[INFO] [stdout]    |
[INFO] [stdout] 40 |                 let mut temp: Vec<i32> = Solution::traversal(&mut q2, &mut q1);
[INFO] [stdout]    |                     ----^^^^
[INFO] [stdout]    |                     |
[INFO] [stdout]    |                     help: remove this `mut`
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]  --> src/s0001_two_sum.rs:3:8
[INFO] [stdout]   |
[INFO] [stdout] 3 | struct Solution;
[INFO] [stdout]   |        ^^^^^^^^
[INFO] [stdout]   |
[INFO] [stdout]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `two_sum` is never used
[INFO] [stdout]  --> src/s0001_two_sum.rs:6:12
[INFO] [stdout]   |
[INFO] [stdout] 5 | impl Solution {
[INFO] [stdout]   | ------------- associated function in this implementation
[INFO] [stdout] 6 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stdout]   |            ^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `next_unique` is never used
[INFO] [stdout]   --> src/s0016_3sum_closest.rs:61:12
[INFO] [stdout]    |
[INFO] [stdout]  5 | impl Solution {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] ...
[INFO] [stdout] 61 |     pub fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated function `new` is never used
[INFO] [stdout]   --> src/s0002_add_two_numbers.rs:12:8
[INFO] [stdout]    |
[INFO] [stdout] 10 | impl ListNode {
[INFO] [stdout]    | ------------- associated function in this implementation
[INFO] [stdout] 11 |     #[inline]
[INFO] [stdout] 12 |     fn new(val: i32) -> Self {
[INFO] [stdout]    |        ^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: struct `Solution` is never constructed
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:24:8
[INFO] [stdout]    |
[INFO] [stdout] 24 | struct Solution;
[INFO] [stdout]    |        ^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stdout] warning: associated functions `level_order` and `traversal` are never used
[INFO] [stdout]   --> src/s0102_binary_tree_level_order_traversal.rs:27:12
[INFO] [stdout]    |
[INFO] [stdout] 26 | impl Solution {
[INFO] [stdout]    | ------------- associated functions in this implementation
[INFO] [stdout] 27 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stdout]    |            ^^^^^^^^^^^
[INFO] [stdout] ...
[INFO] [stdout] 52 |     fn traversal(origin: &mut VecDeque<Rc<RefCell<TreeNode>>>,
[INFO] [stdout]    |        ^^^^^^^^^
[INFO] [stdout] 
[INFO] [stdout] 
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.50s
[INFO] running `Command { std: "docker" "inspect" "b3c35cb293a78fcdf7be34cae6700e9879ab4527b031a5df3f981b7ccc36bf83", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "b3c35cb293a78fcdf7be34cae6700e9879ab4527b031a5df3f981b7ccc36bf83", kill_on_drop: false }`
[INFO] [stdout] b3c35cb293a78fcdf7be34cae6700e9879ab4527b031a5df3f981b7ccc36bf83
[INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-4-tc2/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d429b63d4308055ea97f60fb1d3dfca48854a00942f1bd2ad806beaf015945ec" "/opt/rustwide/cargo-home/bin/cargo" "+0abe69e6c16114311cc2700e972492e64d69c28f" "test" "--frozen", kill_on_drop: false }`
[INFO] [stdout] 267a837742e1819dbb6b1e4c8ac5f9103dd572d5d3dd4a3f9b1b18d1217b736e
[INFO] running `Command { std: "docker" "start" "-a" "267a837742e1819dbb6b1e4c8ac5f9103dd572d5d3dd4a3f9b1b18d1217b736e", kill_on_drop: false }`
[INFO] [stderr] warning: unused import: `std::collections::HashMap`
[INFO] [stdout] 
[INFO] [stderr]  --> src/s0020_valid_parentheses.rs:1:5
[INFO] [stdout] running 6 tests
[INFO] [stderr]   |
[INFO] [stdout] test s0002_add_two_numbers::tests::test_solution ... ok
[INFO] [stderr] 1 | use std::collections::HashMap;
[INFO] [stdout] test s0015_3sum::tests::test_solution ... ok
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stdout] test s0215_kth_largest_element_in_an_array::test::test_solution ... ok
[INFO] [stderr]   |
[INFO] [stdout] test s0020_valid_parentheses::tests::test_solution ... ok
[INFO] [stderr]   = note: `#[warn(unused_imports)]` (part of `#[warn(unused)]`) on by default
[INFO] [stdout] test s0016_3sum_closest::tests::test_solution ... ok
[INFO] [stderr] 
[INFO] [stderr] warning: unused imports: `BTreeSet`, `HashMap`, and `HashSet`
[INFO] [stderr]  --> src/s0015_3sum.rs:1:24
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::collections::{HashMap, HashSet, BTreeSet};
[INFO] [stderr]   |                        ^^^^^^^  ^^^^^^^  ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::borrow::BorrowMut`
[INFO] [stderr]  --> src/s0002_add_two_numbers.rs:1:5
[INFO] [stderr]   |
[INFO] [stderr] 1 | use std::borrow::BorrowMut;
[INFO] [stderr]   |     ^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `super::*`
[INFO] [stderr]   --> src/s0215_kth_largest_element_in_an_array.rs:47:9
[INFO] [stderr]    |
[INFO] [stderr] 47 |     use super::*;
[INFO] [stderr]    |         ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `std::cmp::Reverse`
[INFO] [stderr]   --> src/s0215_kth_largest_element_in_an_array.rs:48:9
[INFO] [stderr]    |
[INFO] [stderr] 48 |     use std::cmp::Reverse;
[INFO] [stderr]    |         ^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/s0016_3sum_closest.rs:25:13
[INFO] [stderr]    |
[INFO] [stderr] 25 |         let mut nums = nums;
[INFO] [stderr]    |             ----^^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_mut)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/s0016_3sum_closest.rs:47:13
[INFO] [stderr]    |
[INFO] [stderr] 47 |         let mut result: Vec<(i32, i32)> = Vec::new();
[INFO] [stderr]    |             ----^^^^^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `result`
[INFO] [stderr]   --> src/s0016_3sum_closest.rs:47:13
[INFO] [stderr]    |
[INFO] [stderr] 47 |         let mut result: Vec<(i32, i32)> = Vec::new();
[INFO] [stderr]    |             ^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_result`
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(unused_variables)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `target` is never read
[INFO] [stderr]   --> src/s0002_add_two_numbers.rs:26:26
[INFO] [stderr]    |
[INFO] [stderr] 26 |         let mut target = 0;
[INFO] [stderr]    |                          ^
[INFO] [stderr]    |
[INFO] [stderr]    = help: maybe it is overwritten before being read?
[INFO] [stderr]    = note: `#[warn(unused_assignments)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: value assigned to `result` is never read
[INFO] [stderr]  --> src/s0215_kth_largest_element_in_an_array.rs:7:26
[INFO] [stderr]   |
[INFO] [stderr] 7 |         let mut result = 0;
[INFO] [stderr]   |                          ^
[INFO] [stderr]   |
[INFO] [stderr]   = help: maybe it is overwritten before being read?
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/s0102_binary_tree_level_order_traversal.rs:35:21
[INFO] [stderr]    |
[INFO] [stderr] 35 |                 let mut temp = Solution::traversal(&mut q1, &mut q2);
[INFO] [stderr]    |                     ----^^^^
[INFO] [stderr]    |                     |
[INFO] [stderr]    |                     help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/s0102_binary_tree_level_order_traversal.rs:40:21
[INFO] [stderr]    |
[INFO] [stderr] 40 |                 let mut temp: Vec<i32> = Solution::traversal(&mut q2, &mut q1);
[INFO] [stderr]    |                     ----^^^^
[INFO] [stderr]    |                     |
[INFO] [stderr]    |                     help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/s0020_valid_parentheses.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution();
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `is_valid` and `pair` are never used
[INFO] [stderr]   --> src/s0020_valid_parentheses.rs:6:12
[INFO] [stderr]    |
[INFO] [stderr]  5 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr]  6 |     pub fn is_valid(s: String) -> bool {
[INFO] [stderr]    |            ^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 24 |     pub fn pair(open: char, close: char) -> bool {
[INFO] [stderr]    |            ^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/s0001_two_sum.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `two_sum` is never used
[INFO] [stderr]  --> src/s0001_two_sum.rs:6:12
[INFO] [stderr]   |
[INFO] [stderr] 5 | impl Solution {
[INFO] [stderr]   | ------------- associated function in this implementation
[INFO] [stderr] 6 |     pub fn two_sum(nums: Vec<i32>, target: i32) -> Vec<i32> {
[INFO] [stderr]   |            ^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/s0015_3sum.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `three_sum`, `two_sum`, and `next_unique` are never used
[INFO] [stderr]   --> src/s0015_3sum.rs:6:12
[INFO] [stderr]    |
[INFO] [stderr]  5 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr]  6 |     pub fn three_sum(nums: Vec<i32>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 35 |     pub fn two_sum(nums: &[i32], target: i32) -> Vec<(i32, i32)> {
[INFO] [stderr]    |            ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 52 |     pub fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/s0016_3sum_closest.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `three_sum_closest`, `three_sum`, `two_sum`, and `next_unique` are never used
[INFO] [stderr]   --> src/s0016_3sum_closest.rs:6:12
[INFO] [stderr]    |
[INFO] [stderr]  5 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr]  6 |     pub fn three_sum_closest(nums: Vec<i32>, target: i32) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 20 |     pub fn three_sum(nums: &mut Vec<i32>, target: i32) -> bool {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 46 |     pub fn two_sum(nums: &[i32], target: i32) -> bool {
[INFO] [stderr]    |            ^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 61 |     pub fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `new` is never used
[INFO] [stderr]   --> src/s0002_add_two_numbers.rs:12:8
[INFO] [stderr]    |
[INFO] [stderr] 10 | impl ListNode {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 11 |     #[inline]
[INFO] [stderr] 12 |     fn new(val: i32) -> Self {
[INFO] [stderr]    |        ^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/s0002_add_two_numbers.rs:20:8
[INFO] [stderr]    |
[INFO] [stderr] 20 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `add_two_numbers` is never used
[INFO] [stderr]   --> src/s0002_add_two_numbers.rs:23:12
[INFO] [stderr]    |
[INFO] [stderr] 22 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] 23 |     pub fn add_two_numbers(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>) -> Option<Box<ListNode>> {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function `print_list` is never used
[INFO] [stderr]    --> src/s0002_add_two_numbers.rs:101:12
[INFO] [stderr]     |
[INFO] [stderr] 101 |     pub fn print_list(l: Option<Box<ListNode>>) {
[INFO] [stderr]     |            ^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/s0215_kth_largest_element_in_an_array.rs:1:8
[INFO] [stderr]   |
[INFO] [stderr] 1 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `find_kth_largest` and `partition` are never used
[INFO] [stderr]   --> src/s0215_kth_largest_element_in_an_array.rs:4:12
[INFO] [stderr]    |
[INFO] [stderr]  3 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr]  4 |     pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 25 |     pub fn partition(v: &mut [i32], p: i32, r: i32) -> i32 {
[INFO] [stderr]    |            ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]   --> src/s0102_binary_tree_level_order_traversal.rs:24:8
[INFO] [stderr]    |
[INFO] [stderr] 24 | struct Solution;
[INFO] [stderr]    |        ^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: associated functions `level_order` and `traversal` are never used
[INFO] [stderr]   --> src/s0102_binary_tree_level_order_traversal.rs:27:12
[INFO] [stderr]    |
[INFO] [stderr] 26 | impl Solution {
[INFO] [stderr]    | ------------- associated functions in this implementation
[INFO] [stderr] 27 |     pub fn level_order(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<Vec<i32>> {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] ...
[INFO] [stderr] 52 |     fn traversal(origin: &mut VecDeque<Rc<RefCell<TreeNode>>>,
[INFO] [stderr]    |        ^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `leetcode` (lib) generated 28 warnings (run `cargo fix --lib -p leetcode` to apply 10 suggestions)
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/s0002_add_two_numbers.rs:76:13
[INFO] [stderr]    |
[INFO] [stderr] 76 |         let mut l1 = Some(Box::new(ListNode{
[INFO] [stderr]    |             ----^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: variable does not need to be mutable
[INFO] [stderr]   --> src/s0002_add_two_numbers.rs:87:13
[INFO] [stderr]    |
[INFO] [stderr] 87 |         let mut l2 = Some(Box::new(ListNode{
[INFO] [stderr]    |             ----^^
[INFO] [stderr]    |             |
[INFO] [stderr]    |             help: remove this `mut`
[INFO] [stderr] 
[INFO] [stderr] warning: struct `Solution` is never constructed
[INFO] [stderr]  --> src/s0001_two_sum.rs:3:8
[INFO] [stderr]   |
[INFO] [stderr] 3 | struct Solution;
[INFO] [stderr]   |        ^^^^^^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: `#[warn(dead_code)]` (part of `#[warn(unused)]`) on by default
[INFO] [stderr] 
[INFO] [stderr] warning: associated function `next_unique` is never used
[INFO] [stderr]   --> src/s0016_3sum_closest.rs:61:12
[INFO] [stderr]    |
[INFO] [stderr]  5 | impl Solution {
[INFO] [stderr]    | ------------- associated function in this implementation
[INFO] [stderr] ...
[INFO] [stderr] 61 |     pub fn next_unique(nums: &[i32], idx: usize, forward: bool) -> usize {
[INFO] [stderr]    |            ^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: `leetcode` (lib test) generated 19 warnings (15 duplicates) (run `cargo fix --lib -p leetcode --tests` to apply 2 suggestions)
[INFO] [stderr]     Finished `test` profile [unoptimized + debuginfo] target(s) in 0.02s
[INFO] [stderr]      Running unittests src/lib.rs (/opt/rustwide/target/debug/deps/leetcode-1d1c5491a7efd8ae)
[INFO] [stdout] test s0102_binary_tree_level_order_traversal::tests::test_solution ... ok
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 6 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.01s
[INFO] [stdout] 
[INFO] [stderr]    Doc-tests leetcode
[INFO] [stdout] 
[INFO] [stdout] running 0 tests
[INFO] [stdout] 
[INFO] [stdout] test result: ok. 0 passed; 0 failed; 0 ignored; 0 measured; 0 filtered out; finished in 0.00s
[INFO] [stdout] 
[INFO] running `Command { std: "docker" "inspect" "267a837742e1819dbb6b1e4c8ac5f9103dd572d5d3dd4a3f9b1b18d1217b736e", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "267a837742e1819dbb6b1e4c8ac5f9103dd572d5d3dd4a3f9b1b18d1217b736e", kill_on_drop: false }`
[INFO] [stdout] 267a837742e1819dbb6b1e4c8ac5f9103dd572d5d3dd4a3f9b1b18d1217b736e
